Running Time Predictions for Factoring Algorithms
نویسندگان
چکیده
School of Mathematics, Georgia Tech, Atlanta, GA 30332-0160 USA [email protected] Département de mathématiques et de statistique, Université de Montréal, Montréal QC H3C 3J7, Canada [email protected] Department of Mathematics, University of Pennsylvania, 209 S. 33rd Street, Philadelphia, Pennsylvania 19104, USA [email protected] School of Mathematics and College of Computing, Georgia Tech, Atlanta, GA 30332-0160 USA [email protected]
منابع مشابه
The technical newsletter of RSA Laboratories , a division of RSA Data Security
All the known factoring algorithms can be divided into two broad types: algorithms whose running time depends on the size of the factors, and algorithms whose running time depends only on the size of the factored number n. The oldest factoring algorithms typically searched for the smallest factor p of n, and were thus of the first type. However, modern algorithms tend to use indirect approaches...
متن کاملSmoothness and Factoring Polynomials Over Finite Fields
Let p be a prime number, and F p the nite eld with p elements. Let S(m) be the \smoothness" function that for integers m is deened as the largest prime divisor of m. In this note, we prove the following theorem. Theorem. There is a deterministic algorithm for factoring polynomials over F p , which on poly-nomials over F p of degree n runs in time S(p ? 1) 1=2 (n log p) O(1) under the assumption...
متن کاملGNFS Factoring Statistics of RSA-100, 110, ..., 150
GNFS (general number field sieve) algorithm is currently the fastest known algorithm for factoring large integers. Up to the present, several running time estimates for GNFS are announced (ex. [LV00]). These estimates are usually based on the previous factoring results. However, since the previous factoring results were done by various programs and/or computers, it is difficult to compare those...
متن کاملOld and New Deterministic Factoring Algorithms
In recent years, there has been spectacular progress in the practical art of factoring. By contrast, the theoretical problem of nding deterministic algorithms which provably factor composite n has made little, if any, progress since Pollard ((Pol]) and Strassen ((Str]) showed that FFT techniques could be utilised to factor an integer n in O(n 1=4+) steps. (Here, and in similar estimates, is a p...
متن کاملRemoving Randomness
In recent years, many probabilistic algorithms (i.e., algorithms that can toss coins) that run in polynomial time have been discovered for problems with no known deterministic polynomial time algorithms. Perhaps the most famous example is the problem of testing large (say, 100 digit) numbers for primality. Even for problems which are known to have deterministic polynomial time algorithms, these...
متن کامل